John-type Theorems for Generalized Arithmetic Progressions and Iterated Sumsets

نویسندگان

  • TERENCE TAO
  • VAN VU
چکیده

A classical theorem of Fritz John allows one to describe a convex body, up to constants, as an ellipsoid. In this article we establish similar descriptions for generalized (i.e. multidimensional) arithmetic progressions in terms of proper (i.e. collision-free) generalized arithmetic progressions, in both torsion-free and torsion settings. We also obtain a similar characterization of iterated sumsets in arbitrary abelian groups in terms of progressions, thus strengthening and extending recent results of Szemerédi and Vu.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The additive structure of the squares inside rings

When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set’s underlying structure. We begin by investigating finite sets of perfect squares and associated sumsets. We reveal how arithmetic progressions efficiently reduce the cardinality of sumsets and provide estimates for the min...

متن کامل

ARITHMETIC PROGRESSIONS IN SPARSE SUMSETS Dedicated to Ron Graham on the occasion of his 70 birthday

In this paper we show that sumsets A + B of finite sets A and B of integers, must contain long arithmetic progressions. The methods we use are completely elementary, in contrast to other works, which often rely on harmonic analysis.

متن کامل

Arithmetic Progressions in Sparse Sumsets

In this paper we show that sumsets A + B of finite sets A and B of integers, must contain long arithmetic progressions. The methods we use are completely elementary, in contrast to other works, which often rely on harmonic analysis. –Dedicated to Ron Graham on the occasion of his 70 birthday

متن کامل

A Probabilistic Technique for Finding Almost-periods of Convolutions

We introduce a new probabilistic technique for finding ‘almost-periods’ of convolutions of subsets of groups. This gives results similar to the Bogolyubov-type estimates established by Fourier analysis on abelian groups but without the need for a nice Fourier transform to exist. We also present applications, some of which are new even in the abelian setting. These include a probabilistic proof ...

متن کامل

Discrepancy in generalized arithmetic progressions

Estimating the discrepancy of the set of all arithmetic progressions in the first N natural numbers was one of the famous open problem in combinatorial discrepancy theory for a long time, successfully solved by K. Roth (lower bound) and Beck (upper bound). They proved that D(N) = minχ maxA | ∑ x∈A χ(x)| = Θ(N1/4), where the minimum is taken over all colorings χ : [N ] → {−1, 1} and the maximum ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008